@InProceedings{FariasMitcSilvWyli:2000:TiReIr,
author = "Farias, Ricardo and Mitchell, Joseph S. B. and Silva, Cl{\'a}udio
T. and Wylie, Brian",
title = "Time-critical rendering of irregular grids",
booktitle = "Proceedings...",
year = "2000",
editor = "Carvalho, Paulo Cezar Pinto and Walter, Marcelo",
pages = "243--250",
organization = "Brazilian Symposium on Computer Graphics and Image Processing, 13.
(SIBGRAPI)",
publisher = "IEEE Computer Society",
address = "Los Alamitos",
note = "The conference was held in Gramado, RS, Brazil, from October 17 to
20.",
keywords = "endering (computer graphics), time-critical rendering, irregular
grids, rendering techniques, image generation, irregular grid data
sets, fastest algorithms, real time analysis, data sets, computer
hardware, very large data set analysis, simplification,
triangulation, optimizations, approximation methods, object space,
time budget, hierarchical representations, frame rates,
medium-sized data sets, rendering algorithms, image accuracy.",
abstract = "Many papers have presented rendering techniques and simplification
ideas with the objective of speeding up image generation for
irregular grid data sets. For large data sets, however, even the
current fastest algorithms are known to require seconds to
generate each image, making real time analysis of such data sets
very difficult, or even impossible, unless one has access to
powerful and expensive computer hardware. In order to synthesize a
system for handling very large data set analysis, we have
assembled algorithms for rendering, simplification and
triangulation, and added to them some optimizations. We have made
some improvements on one of the best current algorithms for
rendering irregular grids, and added to it some simple
approximation methods in both image and object space, resulting in
a system that achieves high frame rates, even on slow computers
without any specific graphic hardware. The algorithm adapts itself
to the time budget it has available for each image generation,
using hierarchical representations of the mesh for faster delivery
of images when transformations are imposed to the data. When given
additional time, the algorithm generates finer images, obtaining
the precise final image if given sufficient time. We were able to
obtain frame rates of the order of 5 Hz for medium-sized data
sets, which is about 20 times faster than previous rendering
algorithms. With a trade-off between image accuracy and speed,
similar frame rates can be achieved on different computers.",
conference-location = "Gramado, RS, Brazil",
conference-year = "17-20 Oct. 2000",
doi = "10.1109/SIBGRA.2000.883919",
url = "http://dx.doi.org/10.1109/SIBGRA.2000.883919",
organisation = "SBC - Brazilian Computer Society",
ibi = "6qtX3pFwXQZeBBx/w5vqw",
url = "http://urlib.net/ibi/6qtX3pFwXQZeBBx/w5vqw",
targetfile = "243-250.pdf",
urlaccessdate = "2024, May 04"
}